Using synchronized oscillators to compute the maximum independent set
نویسندگان
چکیده
منابع مشابه
How to compute using globally coupled oscillators
Synchronization is known to play a vital role within many highly connected neural systems such as the olfactory systems of fish and insects. In this paper we show how one can robustly and effectively perform practical computations using small perturbations to a very simple globally coupled network of coupled oscillators. Computations are performed by exploiting the spatiotemporal dynamics of a ...
متن کاملUsing critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The effectiveness of the proposed approach on large graphs with large independence number is demonstrated through extensive numerical experiments.
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملUsing Critical Sets for the Maximum Independent Set Problem Solving
The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method that utilizes a nonempty critical independent set for solving the maximum independent set problem is developed. The efficiency of the proposed...
متن کاملAn Eecient Algorithm to Compute the Synchronized Product a yet More Eecient Algorithm to Compute the Synchronized Product
Computing all the reachable states of synchronized automata is important in the mechanical ver-iication of concurrent programs. It is however a hard task because this set of states grows typically exponentialy in the number of automata involved. We present a new approach that yields interesting experimental results, both in memory requirements and computation times. It uses a new data structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Communications
سال: 2020
ISSN: 2041-1723
DOI: 10.1038/s41467-020-18445-1